In this paper, we introduce an efficient iterative solver for the jointlinear-programming (LP) decoding of low-density parity-check (LDPC) codes andfinite-state channels (FSCs). In particular, we extend the approach ofiterative approximate LP decoding, proposed by Vontobel and Koetter andexplored by Burshtein, to this problem. By taking advantage of the dual-domainstructure of the joint decoding LP, we obtain a convergent iterative algorithmfor joint LP decoding whose structure is similar to BCJR-based turboequalization (TE). The result is a joint iterative decoder whose complexity issimilar to TE but whose performance is similar to joint LP decoding. The mainadvantage of this decoder is that it appears to provide the predictability ofjoint LP decoding and superior performance with the computational complexity ofTE.
展开▼
